A Simple Level Set Method for Solving Stefan Problems
نویسندگان
چکیده
sented. This method can be applied to problems involving dendritic The process of crystal growth begins when one places a solidification. Our method consists of an implicit finite difference small seed of solid material into a surrounding bath of scheme for solving the heat equation and a level set approach undercooled liquid. Heat is released at the solid/liquid for capturing the front between solid and liquid phases of a pure interface into the liquid region. Undercooling drives the substance. Our method is accurate with respect to some exact solugrowth of the solid and triggers the instability mechanism, tions of the Stefan problem. Results indicate that this method can
منابع مشابه
Solving The Stefan Problem with Kinetics
We introduce and discuss the Homotopy perturbation method, the Adomian decomposition method and the variational iteration method for solving the stefan problem with kinetics. Then, we give an example of the stefan problem with kinetics and solve it by these methods.
متن کاملA New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملSOLVING MULTI CONSTRAINTS STRUCTURAL TOPOLOGY OPTIMIZATION PROBLEM WITH REFORMULATION OF LEVEL SET METHOD
Due to the favorable performance of structural topology optimization to create a proper understanding in the early stages of design, this issue is taken into consideration from the standpoint of research or industrial application in recent decades. Over the last three decades, several methods have been proposed for topology optimization. One of the methods that has been effectively used in stru...
متن کاملA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملRBF-Chebychev direct method for solving variational problems
This paper establishes a direct method for solving variational problems via a set of Radial basis functions (RBFs) with Gauss-Chebyshev collocation centers. The method consist of reducing a variational problem into a mathematical programming problem. The authors use some optimization techniques to solve the reduced problem. Accuracy and stability of the multiquadric, Gaussian and inverse multiq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996